Logical definability on infinite traces
نویسندگان
چکیده
منابع مشابه
Logical Deenability on Innnite Traces
The main results of the present paper are the equivalence of deenability by monadic second-order logic and recognizability for real trace languages, and that rst-order deenable, star-free, and aperiodic real trace languages form the same class of languages. This generalizes results on innnite words and on nite traces to innnite traces. It closes an important gap in the diierent characterization...
متن کاملLogical Definability of Counting Functions
The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is #P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomial-time Turing machine. For a logic L, #L is the class of functions on nite structures counting the tuples (T ; c) satisfying a given formula (T ; c) in ...
متن کاملTraces on Infinite - Dimensional Brauer Algebras ∗
We describe the central measures for the random walk on graded graphs. Using this description , we obtain the list of all finite traces on three infinite-dimensional algebras: on the Brauer algebra, on the partition algebra, and on the walled Brauer algebra. For the first two algebras, these lists coincide with the list of all finite traces of the infinite symmetric group. For the walled Brauer...
متن کاملOn the traces* concatenation of infinite
There is a straightforward generalization of traces to infinite traces as dependence graphs where every vertex has finitely many predecessors, or what is the same, as a backward closed and directed set of traces with respect to prefix ordering. However, this direct approach has a drawback since it does not allow one to describe some basic phenomena which are related to concatenation. We solve t...
متن کاملGeneralized Rational Relations and their Logical Definability
The family of rational subsets of a direct product of free monoids Σ∗ 1×. . .×Σ ∗ n (the rational relations) is not closed under Boolean operations, except when n = 1 or when all Σi’s are empty or singletons. In this paper we introduce the family of generalized rational subsets of an arbitrary monoid as the closure of the singletons under the Boolean operations, concatenation and Kleene star (j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00130-1